Layout of Graphs with Bounded Tree-Width

A \emph{queue layout} of a graph consists of a total order of the vertices, and a partition of the edges into \emph{queues}, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its \emph{queue-number}. A \emph{three-dimensional (straight-line grid) drawing} of a graph represents the vertices by points in $\mathbb{Z}^3$ and the edges by non-crossing line-segments. This paper contributes three main results: (1) It is proved that the minimum volume of a certain type of three-dimensional drawing of a graph $G$ is closely related to the queue-number of $G$. In particular, if $G$ is an $n$-vertex member of a proper minor-closed family of graphs (such as a planar graph), then $G$ has a $O(1)\times O(1)\times O(n)$ drawing if and only if $G$ has O(1) queue-number. (2) It is proved that queue-number is bounded by tree-width, thus resolving an open problem due to Ganley and Heath (2001), and disproving a conjecture of Pemmaraju (1992). This result provides renewed hope for the positive resolution of a number of open problems in the theory of queue layouts. (3) It is proved that graphs of bounded tree-width have three-dimensional drawings with O(n) volume. This is the most general family of graphs known to admit three-dimensional drawings with O(n) volume. The proofs depend upon our results regarding \emph{track layouts} and \emph{tree-partitions} of graphs, which may be of independent interest.Comment: This is a revised version of a journal paper submitted in October 2002. This paper incorporates the following conference papers: (1) Dujmovic', Morin & Wood. Path-width and three-dimensional straight-line grid drawings of graphs (GD'02), LNCS 2528:42-53, Springer, 2002. (2) Wood. Queue layouts, tree-width, and three-dimensional graph drawing (FSTTCS'02), LNCS 2556:348--359, Springer, 2002. (3) Dujmovic' & Wood. Tree-partitions of $k$-trees with applications in graph layout (WG '03), LNCS 2880:205-217, 200

Multiple Sclerosis: MicroRNA Expression Profiles Accurately Differentiate Patients with Relapsing-Remitting Disease from Healthy Controls

Multiple sclerosis (MS) is a chronic inflammatory demyelinating disease of the central nervous system, which is heterogenous with respect to clinical manifestations and response to therapy. Identification of biomarkers appears desirable for an improved diagnosis of MS as well as for monitoring of disease activity and treatment response. MicroRNAs (miRNAs) are short non-coding RNAs, which have been shown to have the potential to serve as biomarkers for different human diseases, most notably cancer. Here, we analyzed the expression profiles of 866 human miRNAs. In detail, we investigated the miRNA expression in blood cells of 20 patients with relapsing-remitting MS (RRMS) and 19 healthy controls using a human miRNA microarray and the Geniom Real Time Analyzer (GRTA) platform. We identified 165 miRNAs that were significantly up- or downregulated in patients with RRMS as compared to healthy controls. The best single miRNA marker, hsa-miR-145, allowed discriminating MS from controls with a specificity of 89.5%, a sensitivity of 90.0%, and an accuracy of 89.7%. A set of 48 miRNAs that was evaluated by radial basis function kernel support vector machines and 10-fold cross validation yielded a specificity of 95%, a sensitivity of 97.6%, and an accuracy of 96.3%. While 43 of the 165 miRNAs deregulated in patients with MS have previously been related to other human diseases, the remaining 122 miRNAs are so far exclusively associated with MS. The implications of our study are twofold. The miRNA expression profiles in blood cells may serve as a biomarker for MS, and deregulation of miRNA expression may play a role in the pathogenesis of MS

miRNAs in lung cancer - Studying complex fingerprints in patient's blood cells by microarray experiments

<p>Abstract</p> <p>Background</p> <p>Deregulated miRNAs are found in cancer cells and recently in blood cells of cancer patients. Due to their inherent stability miRNAs may offer themselves for blood based tumor diagnosis. Here we addressed the question whether there is a sufficient number of miRNAs deregulated in blood cells of cancer patients to be able to distinguish between cancer patients and controls.</p> <p>Methods</p> <p>We synthesized 866 human miRNAs and miRNA star sequences as annotated in the Sanger miRBase onto a microarray designed by febit biomed gmbh. Using the fully automated Geniom Real Time Analyzer platform, we analyzed the miRNA expression in 17 blood cell samples of patients with non-small cell lung carcinomas (NSCLC) and in 19 blood samples of healthy controls.</p> <p>Results</p> <p>Using t-test, we detected 27 miRNAs significantly deregulated in blood cells of lung cancer patients as compared to the controls. Some of these miRNAs were validated using qRT-PCR. To estimate the value of each deregulated miRNA, we grouped all miRNAs according to their diagnostic information that was measured by Mutual Information. Using a subset of 24 miRNAs, a radial basis function Support Vector Machine allowed for discriminating between blood cellsamples of tumor patients and controls with an accuracy of 95.4% [94.9%-95.9%], a specificity of 98.1% [97.3%-98.8%], and a sensitivity of 92.5% [91.8%-92.5%].</p> <p>Conclusion</p> <p>Our findings support the idea that neoplasia may lead to a deregulation of miRNA expression in blood cells of cancer patients compared to blood cells of healthy individuals. Furthermore, we provide evidence that miRNA patterns can be used to detect human cancers from blood cells.</p

Approches intégrées du patrimoine dissonant du xxe siècle en Europe. Perspectives et stratégies à plusieurs voix explorées dans l’Agenda urbain

Dissonant heritage sites represent the many layers of 20th century European history as well as the controversial forms of cultural heritage. Within the Partnership on Culture and Cultural Heritage and its action “Integrated Approaches to Dissonant Heritage”, the urban agenda for the EU focuses on potential ways for enhancing the value of 20th century dissonant heritage sites in small towns and peripheral regions of Europe through various integrated approaches. Participating in the Partnership of the Urban Agenda plays is key to raising the public’s awareness of dissonant heritage, and the potential it holds in Europe. An accompanying study and the recommendations that have been developed in February of 2022 show that dissonant heritage sites can help strengthen democracy, education, tourism and sustainable urban and regional development. It is important to make the public aware of dissonant heritage sites and their potential by increasing and coordinating collaboration at the local, regional and national levels; intensifying links and cooperation at the European level; and connecting dissonant heritage with other areas such as education (in and beyond schools), culture, social engagement, and urban or regional planning. Such processes should place greater emphasis on framework conditions in smaller towns and peripheral areas of Europe

Integrated Approaches to 20th Century Dissonant Heritage in Europe. Multi-vocal perspectives and strategies explored in the Urban Agenda

Dissonant heritage sites represent the many layers of 20th century European history as well as the controversial forms of cultural heritage. Within the Partnership on Culture and Cultural Heritage and its action “Integrated Approaches to Dissonant Heritage”, the Urban Agenda for the EU focuses on potential ways for enhancing the value of 20th century dissonant heritage sites in small towns and peripheral regions of Europe through various integrated approaches. Participating in the Partnership of the Urban Agenda plays is key to raising the public’s awareness of dissonant heritage, and the potential it holds in Europe. An accompanying study and the recommendations that have been developed in February of 2022 show that dissonant heritage sites can help strengthen democracy, education, tourism and sustainable urban and regional development. It is important to make the public aware of dissonant heritage sites and their potential by increasing and coordinating collaboration at the local, regional and national levels; intensifying links and cooperation at the European level; and connecting dissonant heritage with other areas such as education (in and beyond schools), culture, social engagement, and urban or regional planning. Such processes should place greater emphasis on framework conditions in smaller towns and peripheral areas of Europe

Generalized coloring for tree-like graphs

We discuss the Precoloring Extension (PrExt) and the List Coloring (LiCol) problems for trees, partial k-trees and cographs in the decision and the construction versions. Both problems for partial k-trees are solved in linear time, when the number of colors is bounded by a constant and by O(jV j k+2 )- algorithms in general. For trees, we improve this to linear time. In contrast to that, PrExt and LiCol differ in complexity for cographs. While the first has a linear decision algorithm, the second is shown to be NP-complete. We give polynomial time algorithms for the corresponding enumeration problems #PrExt and #LiCol on partial k-trees and trees and for #PrExt on cographs. 1 Introduction This paper was motivated by Bir&apos;o, Hujter and Tuza [BHT], where the following generalization of the Chromatic Number problem has been con- Fachbereich Mathematik und Informatik, Universitat Trier, Postfach 38 25, W-5500 Trier, Germany. (E-mail: [email protected]) supported in part by the D..

The Disjoint Cliques Problem

Given a graph G=(V,E), we consider the problem of finding a set of D pairwise disjoint cliques in the graph with maximum overall number of vertices. We determine the computational complexity of this problem restricted to a variety of different graph classes. We give polynomial time algorithms for the problem restricted to interval graphs, bipartite graphs, cographs, directed path graphs and partial k-trees. In contrast, we show the NP-completeness for undirected path graphs. Moreover, we investigate a closely related scheduling problem